Multi-objective Hierarchic Memetic Solver for Inverse Parametric Problems
نویسندگان
چکیده
منابع مشابه
A memetic algorithm for multi-objective dynamic location problems
This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, c...
متن کاملOn solving multi-objective bin packing problems using memetic algorithms
The bin-packing problem (BPP) and its multi-dimensional variants have many practical applications, such as packing objects in boxes, production planning, multiprocessor scheduling, etc. The classical singleobjective formulation of the two-dimensional bin packing (2D-BPP) consists of packing a set of objects (pieces) in the minimum number of bins (containers). This paper presents a new Pareto-ba...
متن کاملAn Agent-Oriented Hierarchic Strategy for Solving Inverse Problems
The paper discusses the complex, agent-oriented hierarchic memetic strategy (HMS) dedicated to solving inverse parametric problems. The strategy goes beyond the idea of two-phase global optimization algorithms. The global search performed by a tree of dependent demes is dynamically alternated with local, steepest descent searches. The strategy offers exceptionally low computational costs, mainl...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملA Hybrid MOEA/D-TS for Solving Multi-Objective Problems
In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2015
ISSN: 1877-0509
DOI: 10.1016/j.procs.2015.05.239